1 SOLVING PROBABILISTIC COMBINATORIAL GAMES Ling Zhao1 and Martin M¨uller2 Department of Computing Science University of Alberta

Source URL: webdocs.cs.ualberta.ca

1 Neuroevolution in Games: State of the Art and Open Challenges arXiv:1410.7326v3 [cs.NE] 3 Nov 2015

Source URL: arxiv.org

Learning and Solving Many-Player Games through a Cluster-Based Representation Sevan G. Ficici Harvard School of Engineering and Applied Sciences

Source URL: uai2008.cs.helsinki.fi

Staged Self-Assembly and Polyomino Context-Free Grammars A dissertation submitted by Andrew Winslow in partial fulfillment of the requirements for the degree of

Source URL: www.cs.tufts.edu

• Formal languages
• Polyforms
• Mathematical games
• Mathematics
• Polyomino
• Language
• Culture
• Stochastic context-free grammar
• Context-free grammar
• CFGS
• CFG
• Context-free language

Identifying reasoning patterns in games Dimitrios Antos School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138

Source URL: uai2008.cs.helsinki.fi

Procedural Quests: A Focus for Agent Interaction in Role-Playing-Games John Grey and Joanna Bryson1 Abstract. In current videogames non-player characters’ (NPCs’) abilities to be active, dynamic agents are typically

Source URL: www.cs.bath.ac.uk

CS3191 Section 6 Games and evolution Andrea Schalk School of Computer Science, University of Manchester Andrea Schalk: CS3191 Section 6 – p. 1/57

Source URL: www.cs.man.ac.uk

Mean-Payoff Games and the Max-Atom Problem Elitza Maneva Universitat Polit`ecnica de Catalunya Barcelona, Spain Albert Atserias

Source URL: www.cs.upc.edu

CS 683 — Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg

Source URL: www.cs.cornell.edu

Winning Strategies in Concurrent Games Glynn Winskel University of Cambridge Computer Laboratory A principled way to develop nondeterministic concurrent strategies in games within a general model for concurrency. Followi

Source URL: www.cs.ox.ac.uk